/**
 * 二叉树
 */
public class Test {
    /**
     * 二叉树的基本操作
     * @param args
     */
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode ret = binaryTree.createBinaryTree();
        binaryTree.size(ret);
        System.out.println(BinaryTree.nodeSize);
        System.out.println(binaryTree.size2(ret));

        binaryTree.getLeafNodeCount(ret);
        System.out.println(BinaryTree.leafSize);
        System.out.println(binaryTree.getLeafNodeCount2(ret));

        System.out.println(binaryTree.getKLevelNodeCount(ret,3));

        System.out.println(binaryTree.getHeight(ret));

        System.out.println(binaryTree.find(ret,'A').val);
    }
}
